Optimizing over Consecutive 1's and Circular 1's Constraints

نویسندگان

  • Dorit S. Hochbaum
  • Asaf Levin
چکیده

We consider packing and covering optimization problems over constraints in consecutive and circular 1’s. Such problems arise in the context of shift scheduling, and in problems related to interval graphs. Previous approaches to this problem depended on solving several minimum cost network flow problems. We devise here substantially more efficient and strongly polynomial algorithms based on parametric shortest paths approaches. The objective function in the covering and packing problems is to either minimize or maximize the number of sets that satisfy the constraints. The various problems studied are classified according to whether the constraints are all consecutive 1’s or if there are also circular 1’s constraints, and according to whether the constraints are all of covering type; all of packing type, or mixed. The running time of our algorithm for a pure covering all consecutive 1’s constraints problem on n variables and m constraints is O(m + n). For the pure packing problem with consecutive 1’s constraints we present an O(m + n log n) time algorithm. For the “mixed” case with both covering and packing consecutive 1’s constraints we present an O(mn) time algorithm. An O(mn + n log n)-time algorithm is presented for the case where the constraints are circular (consecutive 1’s constraint is also circular) of pure type – either all covering constraints or all packing constraints. Finally, we show an O(n min{mn,n2 log n + m log n}) time algorithm for the most general problem of mixed covering and packing case where the constraints are circular. All our algorithms are strongly polynomial and improve on the non-strongly polynomial parametric minimum cost network flow or the (strongly polynomial) linear programming known approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Every 2-choosable graph is circular consecutive 2-choosable

Suppose G is a graph, r is a positive real number and S(r) is a circle of perimeter r. For a positive real number t ≤ r, a (t, r)circular consecutive colour-list assignment L is a mapping that assigns to each vertex v of G an interval L(v) of S(r) of length t. A circular L-colouring of G is a mapping f : V (G) → S(r) such that for each vertex v, f(v) ∈ L(v) and for each edge uv, the distance be...

متن کامل

Optimizing Product Combination in Continuous Production Companies

The optimum use of the upstream resources, production corresponding to the market demands, and structural constraints for the optimum production with the less wastes during the most rapid time required by the market which finally result in the more profit for the shareholders are considered as the major objectives of this research. In this research, for the purpose of increasing the efficiency ...

متن کامل

Circular consecutive choosability of k-choosable graphs

Let S(r) denote a circle of circumference r. The circular consecutive choosability chcc(G) of a graph G is the least real number t such that for any r > χc(G), if each vertex v is assigned a closed interval L(v) of length t on S(r), then there is a circular r-colouring f of G such that f(v) ∈ L(v). We investigate, for a graph, the relations between its circular consecutive choosability and choo...

متن کامل

Circular consecutive choosability of graphs

Abstract This paper considers list circular colouring of graphs in which the colour list assigned to each vertex is an interval of a circle. The circular consecutive choosability chcc(G) of G is defined to be the least t such that for any circle S(r) of length r ≥ χc(G), if each vertex x of G is assigned an interval L(x) of S(r) of length t, then there is a circular r-colouring f of G such that...

متن کامل

Optimality Constraints For the Cone of Positive Polynomials

Consider a proper cone K ⊂ < and its dual cone K. It is well known that the complementary slackness condition xs = 0 defines an n-dimensional manifold C(K) = { (x, s) : x ∈ K, s ∈ K, xs = 0 } ⊂ <×<. When K is a symmetric cone, this manifold can be described by a set of n bilinear equalities. This fact proves to be very useful when optimizing over such cones, therefore it is natural to look for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2006